/*
 * Copyright (C) 2011 Nicola Bonzanni
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package nl.vu.few.ibivu.jlemon;

import nl.vu.few.ibivu.jlemon.concepts.Arc;
import nl.vu.few.ibivu.jlemon.concepts.Edge;
import nl.vu.few.ibivu.jlemon.concepts.Graph;
import nl.vu.few.ibivu.jlemon.concepts.HasEdges;
import nl.vu.few.ibivu.jlemon.concepts.HasEdge;
import nl.vu.few.ibivu.jlemon.concepts.IncidentEdgeIterator;
import nl.vu.few.ibivu.jlemon.concepts.Node;

public abstract class GraphForwarder<N extends Node & Comparable<N>, E extends Edge & Comparable<E>, A extends Arc & HasEdge<E> & Comparable<A>, G extends Graph<N,A> & HasEdges<N,E,A>> extends DigraphForwarder<N,A,G> implements Graph<N,A>, HasEdges<N,E,A> {

	protected abstract G delegate();
	
	@Override
	public N u(E edge) {
		return delegate().u(edge);
	}

	@Override
	public N v(E edge) {
		return delegate().v(edge);
	}

	@Override
	public int id(E edge) {
		return delegate().id(edge);
	}

	@Override
	public E edgeFromId(int id) {
		return delegate().edgeFromId(id);
	}

	@Override
	public int maxEdgeId() {
		return delegate().maxEdgeId();
	}

	@Override
	public boolean direction(A arc) {
		return delegate().direction(arc);
	}

	@Override
	public A direct(E edge, boolean inherent) {
		return delegate().direct(edge, inherent);
	}

	@Override
	public A direct(E edge, N node) {
		return delegate().direct(edge, node);
	}

	@Override
	public A oppositeArc(A arc) {
		return delegate().oppositeArc(arc);
	}

	@Override
	public N oppositeNode(N node, E edge) {
		return delegate().oppositeNode(node, edge);
	}

	@Override
	public N source(A arc) {
		return delegate().source(arc);
	}

	@Override
	public N target(A arc) {
		return delegate().target(arc);
	}

	@Override
	public int id(N node) {
		return delegate().id(node);
	}

	@Override
	public int id(A arc) {
		return delegate().id(arc);
	}

	@Override
	public N nodeFromId(int id) {
		return delegate().nodeFromId(id);
	}

	@Override
	public A arcFromId(int id) {
		return delegate().arcFromId(id);
	}

	@Override
	public int maxNodeId() {
		return delegate().maxNodeId();
	}

	@Override
	public int maxArcId() {
		return delegate().maxArcId();
	}

	@Override
	public N oppositeNode(N node, A arc) {
		return delegate().oppositeNode(node, arc);
	}

	@Override
	public int edgeNum() {
		return delegate().edgeNum();
	}

	@Override
	public E firstEdge() {
		return delegate().firstEdge();
	}

	@Override
	public E next(E edge) {
		return delegate().next(edge);
	}

	@Override
	public E firstInc(IncidentEdgeIterator<E> iterator, N node) {
		return delegate().firstInc(iterator, node);
	}

	@Override
	public E nextInc(IncidentEdgeIterator<E> iterator) {
		return delegate().nextInc(iterator);
	}

	@Override
	public Class<E> getEdgeClass() {
		return delegate().getEdgeClass();
	}
}
